منابع مشابه
Towards a Theory of Indexability (
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We identify two measures of eeciency of an indexing scheme for a work load: storage redundancy (how many times each item in the data set is stored), and disk access ratio (how many times more blocks than necessary does a query retrieve). We show interesting upper and lower b...
متن کاملThe Theory of Concentration Oligopoly
This paper originates the theory of buyer concentration for a main raw material input for a single processing industry. The Oligopsony concentration is obtained and subsequently decomposed into several factors, affecting indirectly the industry’s profitability. It is found that the leading firms’ efficiencies hypothesis is reaffirmed due to variations associated with the marginal productivity d...
متن کاملRestless Bandits, Partial Conservation Laws and Indexability
We show that if performance measures in a general stochastic scheduling problem satisfy partial conservation laws (PCL), which extend the generalized conservation laws (GCL) introduced by Bertsimas and Niño-Mora (1996), then the problem is solved optimally by a priority-index policy under a range of admissible linear performance objectives, with both this range and the optimal indices being det...
متن کاملVC dimension theory for a learning system with forgetting
In a changing environment, forgetting old samples is an e ective method to improve the adaptability of learning systems. However, too fast forgetting causes a decrease of generalization performance. In this paper, we analyze the generalization performance of a learning system with a forgetting parameter. For a class of binary discriminant functions, it is proved that the generalization error is...
متن کاملVC Theory of Large Margin Multi-Category Classifiers
In the context of discriminant analysis, Vapnik’s statistical learning theory has mainly been developed in three directions: the computation of dichotomies with binary-valued functions, the computation of dichotomies with real-valued functions, and the computation of polytomies with functions taking their values in finite sets, typically the set of categories itself. The case of classes of vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.10.002